#include<bits/stdc++.h>
using namespace std;
const int maxn=1e6+5;
typedef long long ll;
ll a[maxn];
ll b[maxn];
ll c[maxn];
int main()
{
    int n;
    cin>>n;
    for(int i=0;i<n;i++)
    {
        ll x,y;
        cin>>x>>y;
        a[i]=x*2;
        b[i]=y*2;
        c[i]=-(x*x+y*y);
     }
    ll max1=0;
    for(int i=0;i<n;i++)
    {
        map<pair<double,double>,ll> p;
        for(int j=i+1;j<n;j++)
        {
            ll d=a[i]*b[j]-a[j]*b[i];
            if(d==0) continue;
            ll x=c[j]*b[i]-c[i]*b[j];
            ll y=c[i]*a[j]-c[j]*a[i];
            ll num=++p[{(double)x/d,(double(y)/d)}];
            max1=max(max1,num);
         }
    }
    cout<<max1+1<<endl;
 }